信息时代战场兵力组织的运作分析与设计

信息化战场空间、扁平化和网络化的兵力组织形式是未来网络中心战中作战部队编成的主要样式。为建立这一编成样式的设计方法和思路,以战场环境中兵力组织为例,分析了PCANS模型对信息时代组织测度的缺陷,在PCANS模型中引入信息因素描述组织的运作,并提出信息时代战场空间兵力组织设计的实质和目标以及设计方法。     

双时间隐式方法求解非定常绕流的相关问题

空间采用三阶精度的WeightedNND(WNND)格式,时间方向则采用具有二阶精度的双时间步隐式方法求解二维非定常Euler方程,数值模拟了NACA0012翼型俯仰强迫振动流场,讨论了内迭代步数、内迭代收敛判据以及物理时间步长对计算结果、计算效率与计算CPU时间的影响,并将计算结果与实验值进行了比较。     

Stochastic modeling for computational warranty analysis

We examine two key stochastic processes of interest for warranty modeling: (1) remaining total warranty coverage time exposure and (2) warranty load (total items under warranty at time t). Integral equations suitable for numerical computation are developed to yield probability law for these warranty measures. These two warranty measures permit warranty managers to better understand time‐dependent warranty behavior, and thus better manage warranty cash reserves. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

利用样条插值法计算摩擦离合器瞬时转速曲线

研究了履带车辆主离合器瞬时转速测试方法,在数据处理过程中两次运用样条插值算法,较好地解决主、被部分实测转速精度低及转速数据长度不一致的问题,得到较为理想的瞬时转速曲线。     

坦克动力舱空气流动计算区域的网格生成

为了合理解决网格划分对坦克动力舱空气流动与传热三维数值计算效率和计算精度的影响,特提出动力舱空气流动计算区域的网格生成方法.对某型坦克动力舱的网格生成实例,显示了这种方法的实用性.     

反导作战指控系统信息流时延模型研究与应用

在现代反导作战中,如何规划反导作战指控系统从而缩短目标、指挥信息传输时间和提高指挥精度是很重要的问题。基于此展开讨论,首先设计规划了3种反导作战指控系统信息流时延模型并提出了应用原则,其次分别以一典型3 500 km TBM和不同射程TBM为例进行了时延模型仿真计算和分析,最后通过分析计算结果给出反导作战指控系统建设性结论。     

大功率IGBT器件及其组合多时间尺度动力学表征研究综述

在提出电力电子器件及其组合多时间尺度动力学表征需求的前提下,以目前常用的全控型电力电子器件——绝缘栅双极晶体管(Insulated Gate Bipolar Transistor,IGBT)为例,系统分析并归纳了目前在IGBT及其组合多时间尺度动力学表征研究方面的进展和成果,包括作为基础的大功率IGBT及其组合多时间尺度电热瞬态建模方法、基于模型的大功率IGBT模块失效量化表征方法以及用于辅助分析的IGBT组合多速率仿真方法。此外,介绍了基于IGBT多时间尺度模型的装置应用设计案例。从建模方法、可靠性评估、仿真手段以及应用设计四个方面系统全面地阐述了大功率IGBT及其组合多时间尺度的动力学表征方法,可为电力电子混杂系统的精确设计提供电力电子器件层面的理论和技术支撑。     

带空气室脉冲水射流系统通用分析法

针对所提出的用空气室引发水力共振以增强脉冲水射流的设想,应用水力瞬变特征线解法,建立系统的数学模型,差分网格只取脉冲源、空气室和喷嘴3个边界点,采用变时步法解算。这种方法具有灵活性大、受限制小、便于使用的突出优点。     

Transient analysis of Markov models of fault‐tolerant systems with deferred repair using split regenerative randomization

The (standard) randomization method is an attractive alternative for the transient analysis of continuous time Markov models. The main advantages of the method are numerical stability, well‐controlled computation error, and ability to specify the computation error in advance. However, the fact that the method can be computationally very expensive limits its applicability. In this paper, we develop a new method called split regenerative randomization, which, having the same good properties as standard randomization, can be significantly more efficient. The method covers reliability‐like models with a particular but quite general structure and requires the selection of a subset of states and a regenerative state satisfying some conditions. For a class of continuous time Markov models, model class C₂, including typical failure/repair reliability‐like models with exponential failure and repair time distributions and deferred repair, natural selections are available for both the subset of states and the regenerative state and, for those natural selections, theoretical results are available assessing the efficiency of the method in terms of “visible” model characteristics. Those results can be used to anticipate when the method can be expected to be competitive. We illustrate the application of the method using a large class C₂ model and show that for models in that class the method can indeed be significantly more efficient than previously available randomization‐based methods. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Optimization and mediated bartering models for ground delay programs

The Federal Aviation Administration (FAA) and the airline community within the United States have adopted a new paradigm for air traffic flow management, called Collaborative Decision Making (CDM). A principal goal of CDM is shared decision‐making responsibility between the FAA and airlines, so as to increase airline control over decisions that involve economic tradeoffs. So far, CDM has primarily led to enhancements in the implementation of Ground Delay Programs, by changing procedures for allocating slots to airlines and exchanging slots between airlines. In this paper, we discuss how these procedures may be formalized through appropriately defined optimization models. In addition, we describe how inter‐airline slot exchanges may be viewed as a bartering process, in which each “round” of bartering requires the solution of an optimization problem. We compare the resulting optimization problem with the current procedure for exchanging slots and discuss possibilities for increased decision‐making capabilities by the airlines. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006